DeepTuner: A System for Search Technique Recommendation in Program Autotuning
نویسنده
چکیده
OpenTuner can help users achieve better or more portable performance in their speci c domain through program autotuning. A key challenge for users seeking good autotuning performance in OpenTuner is selecting a search approach appropriate for problem. However, not only are current in-situ learning search approaches not robust enough to handle all search spaces, but there are also too many possible search approaches for a user to examine manually after factoring in composable techniques. In this thesis, we introduce DeepTuner, a system for search approach recommendation operating across OpenTuner autotuning sessions to facilitate development of robust transfer learning search approaches. By utilizing historical autotuning data via DeepTuner's technique recommendation endpoints, the new search approaches can e ciently explore the space of possible search approaches and the autotuning space simultaneously, resulting in an adaptive, self-improving search approach. We demonstrate the robustness that recommendation brings on nine problems spread over three domains for a variety of initial technique sets. In particular, we show that the new Database Initialized Recommendation Bandit Meta-technique is highly robust, performing on par or signi cantly better than various old in-situ search approaches in OpenTuner. We achieve up to 3.7x performance improvement over the old default in-situ search approach for OpenTuner in the TSP domain.
منابع مشابه
DeepTuner : A System for Search Technique Recommendation in Program
OpenTuner can help users achieve better or more portable performance in their speci c domain through program autotuning. A key challenge for users seeking good autotuning performance in OpenTuner is selecting a search approach appropriate for problem. However, not only are current in-situ learning search approaches not robust enough to handle all search spaces, but there are also too many possi...
متن کاملDiscovering Popular Clicks\' Pattern of Teen Users for Query Recommendation
Search engines are still the most important gates for information search in internet. In this regard, providing the best response in the shortest time possible to the user's request is still desired. Normally, search engines are designed for adults and few policies have been employed considering teen users. Teen users are more biased in clicking the results list than are adult users. This leads...
متن کاملEvaluating the Role of Optimization-Specific Search Heuristics in Effective Autotuning
The increasing complexities of modern architectures require compilers to extensively apply a large collection of architecture-sensitive optimizations, e.g., parallelization and memory locality optimizations, which interact with each other in unpredictable ways. The configuration space of these optimizations are exceedingly large, and heuristics for exploring the search space routinely end up se...
متن کاملTools for machine-learning-based empirical autotuning and specialization
The process of empirical autotuning results in the generation of many code variants which are tested, found to be suboptimal, and discarded. By retaining annotated performance profiles of each variant tested over the course of many autotuning runs of the same code across different hardware environments and different input datasets, we can apply machine learning algorithms to generate classifier...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کامل